Call Admission and End-to-end delay Allocation for Fair Queueing Networks
نویسندگان
چکیده
Many multimedia applications, including audio and video, require quality of service( QOS) guarantees from network. A typical user is only concerned with the QOS requirements on end -to-end basis and does not care about the local switching node QOS. In this paper, we propose a general framework to map the end-to-end QOS requirement into the local switching node QOS requirements. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switch node. Therefore, we focus on the local switching node QOS requirement and design a novel QOS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation( OPT) policy. In addition, we also design an analysis model to evaluate the proposed allocation scheme and equal allocation
منابع مشابه
Performance of Different Call Admission Schemes in a Qos Diffserv Domain
Two types of Call Admission strategies have been proposed for real time support in the Internet: Per flow, Reservation (i.e., RSVP) based, and; Measurement based. In this paper we evaluate these strategies for a video streaming application. We use a simulation environment (based on a Parsec platform) which supports DiffServ tools as well as QoS routing. In our experiments, we compare the perfor...
متن کاملStochastic Bounds on Delays of Fair Queueing Algorithms
In this paper we study the delay characteristics of Fair Queueing algorithms with a stochastic comparison approach. In integrated services networks, Fair Queueing (FQ) algorithms have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traac is bounded, and they ensure the fair allocation of the bandwidth. The delay characteri...
متن کاملFrame-based Fair Queueing: a New Traac Scheduling Algorithm for Packet-switched Networks
abstract In this paper we introduce and analyze frame-based fair queueing, a novel traac scheduling algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds identical to those of PGPS (packet-level generalized processor sharing), without the complexity of simulating the uid-model system in the background as required in PGPS. The algorithm is therefore ideally suite...
متن کاملAn Efficient Call Admission Control for Hard Real Time Communication in Differentiated Services Network
In this paper we study hard real time (HRT) communication over a differentiated service network. Differentiated Services was proposed by IETF as a scalable QoS architecture [1]. Diffserv service providers can provide delay and bandwidth guaranteed service (as per service level agreement (SLA)) by implementing diffserv services with a fair packet scheduling algorithm like WFQ. But this QoS is pr...
متن کاملQoS routing with worst-case delay constraints: Models, algorithms and performance analysis
In a network where weighted fair-queueing schedulers are used at each link, worstcase end-to-end delays can be inferred from per-link rate reservations. Therefore, it is also possible to compute resource-constrained paths that meet target delay constraints, and optimize some key performance metrics (e.g., minimize the overall reserved rate, maximize the remaining capacity at bottleneck links, e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001